M-Functions and Parallel Asynchronous Algorithms
نویسندگان
چکیده
منابع مشابه
Synchronized and asynchronous parallel algorithms for multiprocessors
NOTICE WARNING CONCERNING COPYRIGHT RESTRICTIONS: The copyright law of the United States (title 17, U.S. Code) governs the making of photocopies or other reproductions of copyrighted material. Any copying of this document without permission of its author may be prohibited by law. Abstract Parallel algorithms for multiprocessors are classified into synchronized and asynchronous algorithms. Impor...
متن کاملAsynchronous Analysis of Parallel Dynamic Programming Algorithms
We examine a very simple asynchronous model of parallel computation that assumes the time to compute a task is random, following some probability distribution. The goal of this model is to capture the eeects of unpredictable delays on processors, due to communication delays or cache misses, for example. Using techniques from queueing theory and occupancy problems, we use this model to analyze t...
متن کاملParallel Asynchronous Team Algorithms: Convergence and Performance Analysis
This paper formalizes a general technique to combine different methods in the solution of large systems of nonlinear equations using parallel asynchronous implementations on distributed-memory multiprocessor systems. Such combinations of methods, referred to as Team Algorithms, are evaluated as a way of obtaining desirable properties of different methods and a sufficient condition for their con...
متن کاملParallel synchronous and asynchronous iterative algorithms for Procrustes - type problems ∗
submitted to PMAA’06 Giorgos Kollias CEID, Univ. of Patras GREECE [email protected] Efstratios Gallopoulos CEID, Univ. of Patras GREECE [email protected] Daniel B. Szyld Dept. Math., Temple Univ. USA [email protected] In areas such as Information Retrieval, Pattern Recognition and Image Processing, many data analysis problems contain computational kernels of the form
متن کاملMoving Nature-Inspired Algorithms to Parallel, Asynchronous and Decentralised Environments
This paper motivates research into implementing nature-inspired algorithms in decentralised, asynchronous and parallel environments. These characteristics typify environments such as Peer-To-Peer systems, the Grid and autonomic computing which demand robustness, decentralisation, parallelism, asynchronicity and self-organisation. Nature-inspired systems promise these properties. However, curren...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Numerical Analysis
سال: 1990
ISSN: 0036-1429,1095-7170
DOI: 10.1137/0727008